Numerical Integration for Interactive Terms in Mesh Superposition Method by Auto-Mesh Generation
نویسندگان
چکیده
منابع مشابه
A Moving Mesh Numerical Method
We show that the possibly discontinuous solution of a scalar conservation law in one space dimension may be approximated in i-'(R) to within 0(N~2) by a piecewise linear function with O(N) nodes; the nodes are moved according to the method of characteristics. We also show that a previous method of Dafermos, which uses piecewise constant approximations, is accurate to 0(N~l). These numerical met...
متن کاملAdaptive mesh generation by bubble packing method
The bubble packing method is implemented for adaptive mesh generation in two and three dimensions. Bubbles on the boundary of a three-dimensional domain are controlled independently of the interior bubbles in the domain, and a modified octree technique is employed to place initial bubbles in the three-dimensional zone. Numerical comparisons are made with other mesh generation techniques to demo...
متن کاملA New Method for Triangular Mesh Generation
Computational mathematics plays an increasingly important role in computational fluid dynamics (CFD). The aeronautics and aerospace research community is working on next generation of CFD capacity that is accurate, automatic, and fast. A key component of the next generation of CFD is a greatly enhanced capacity for mesh generation and adaptivity of the mesh according to solution and geometry. I...
متن کاملSurface Mesh Projection for Hexahedral Mesh Generation by Sweeping
Sweep method is one of the most robust techniques to generate hexahedral meshes in extrusion volumes. One of the main issues to be dealt by any sweep algorithm is the projection of a source surface mesh onto the target surface. This paper presents a new algorithm to map a given mesh over the source surface onto the target surface. This projection is carried out by means of a least-squares appro...
متن کاملA Pliant Method for Anisotropic Mesh Generation
A new algorithm for the generation of anisotropic, unstructured triangular meshes in two dimensions is described. Inputs to the algorithm are the boundary geometry and a metric that specifies the desired element size and shape as a function of position. The algorithm is an example of what we call pliant mesh generation. It first constructs the constrained Delaunay triangulation of the domain, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series A
سال: 2011
ISSN: 0387-5008,1884-8338
DOI: 10.1299/kikaia.77.600